Automated theorem proving

Results: 768



#Item
81Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith  J. Christopher Beck

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Add to Reading List

Source URL: www.haz.ca

Language: English - Date: 2013-10-28 07:18:32
82The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2010-03-23 07:22:00
83Specialising the Ground Representation in the Logic Programming Language G odel. C.A.Gurr

Specialising the Ground Representation in the Logic Programming Language G odel. C.A.Gurr

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2010-10-22 08:05:11
84The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-06-15 11:37:40
85The Complexity of Translation Membership for Macro Tree Transducers Kazuhiro Inaba Sebastian Maneth

The Complexity of Translation Membership for Macro Tree Transducers Kazuhiro Inaba Sebastian Maneth

Add to Reading List

Source URL: db.ucsd.edu

Language: English - Date: 2008-12-16 18:43:25
86DERIVING SAFETY CASES FROM AUTOMATICALLY CONSTRUCTED PROOFS Nurlida Basir*, Ewen Denney† and Bernd Fischer* * ECS, University of Southampton, Southampton, SO17 1BJ, UK (nb206r, b.fischer)@ecs.soton.ac.uk †

DERIVING SAFETY CASES FROM AUTOMATICALLY CONSTRUCTED PROOFS Nurlida Basir*, Ewen Denney† and Bernd Fischer* * ECS, University of Southampton, Southampton, SO17 1BJ, UK (nb206r, b.fischer)@ecs.soton.ac.uk †

Add to Reading List

Source URL: ti.arc.nasa.gov

Language: English
87C:/Mina dokument/4th year project/ProjectReport.dvi

C:/Mina dokument/4th year project/ProjectReport.dvi

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Language: English - Date: 2007-02-02 09:38:01
88On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
89DL Reasoner vs. First-Order Prover Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov|horrocks}@cs.man.ac.uk

DL Reasoner vs. First-Order Prover Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov|horrocks}@cs.man.ac.uk

Add to Reading List

Source URL: www.cs.man.ac.uk

Language: English - Date: 2015-02-05 09:51:09
90Towards Efficient Conversions by use of Partial Evaluation Morten Welinder DIKU, Department of Computer Science University of Copenhagen

Towards Efficient Conversions by use of Partial Evaluation Morten Welinder DIKU, Department of Computer Science University of Copenhagen

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2010-10-22 08:04:54